Semantic Preferential Subsumption
نویسندگان
چکیده
We present a general preferential semantic framework for plausible subsumption in description logics, analogous to the KLM preferential semantics for propositional entailment. We introduce the notion of ordered interpretations for description logics, and use it to define two mutually dual non-deductive subsumption relations
منابع مشابه
Semantic Foundation for Preferential Description Logics
Description logics are a well-established family of knowledge representation formalisms in Artificial Intelligence. Enriching description logics with non-monotonic reasoning capabilities, especially preferential reasoning as developed by Lehmann and colleagues in the 90’s, would therefore constitute a natural extension of such KR formalisms. Nevertheless, there is at present no generally accept...
متن کاملNode Subsumption in a Propositional Semantic Network with Structured Variables
We present a formal description of a propositional semantic-network-based knowledge representation system. Variables in this representation are not atomic and have potentially complex structure. We start from the individual components of a semantic network system, atomics nodes and relations that connect nodes, and provide a complete speci cation for the structure of nodes and a subsumption pro...
متن کاملUsing Subsumption in Semantic Query Optimization
Semantic Query Optimization optimize query processing by transforming a query into a semantically equivalent one, i.e. a query whose result is the same for every instance of the database. Semantic query optimization can be obtained by a query rewriting that takes into account the integrity constraints the database must satisfy. In this paper we analyze the possibility of implementing semantic o...
متن کاملAn Enriched UMLS Semantic Network with a Multiple Subsumption Hierarchy
Objective: The Unified Medical Language System’s (UMLS’s) Semantic Network’s (SN’s) two-tree structure is restrictive because it does not allow a semantic type to be a specialization of several other semantic types. In this paper, the SN is expanded into a multiple subsumption structure with a directed acyclic graph (DAG) IS-A hierarchy, allowing a semantic type to have multiple parents. New vi...
متن کاملOn a Semantic Subsumption Test
We observe, that subsumption of clauses (in the language of first order logic), so far understood as a syntactic notion, can also be defined by semantical means. Subsumption is NP-complete and testing subsumption takes roughly half of the running time of a typical first order resolution-based theorem prover. We also give some experimental evidence, that replacing syntactic indexing for subsumpt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008